| 1. Identity statement | |
| Reference Type | Conference Paper (Conference Proceedings) |
| Site | sibgrapi.sid.inpe.br |
| Holder Code | ibi 8JMKD3MGPEW34M/46T9EHH |
| Identifier | 6qtX3pFwXQZG2LgkFdY/MaSC6 |
| Repository | sid.inpe.br/sibgrapi@80/2006/08.16.16.48 |
| Last Update | 2006:08.16.16.50.13 (UTC) administrator |
| Metadata Repository | sid.inpe.br/sibgrapi@80/2006/08.16.16.48.53 |
| Metadata Last Update | 2022:06.14.00.13.19 (UTC) administrator |
| DOI | 10.1109/SIBGRAPI.2006.20 |
| Citation Key | MartinetzMadaMota:2006:FaEaCo |
| Title | Fast and Easy Computation of Approximate Smallest Enclosing Balls  |
| Format | On-line |
| Year | 2006 |
| Access Date | 2024, May 07 |
| Number of Files | 1 |
| Size | 539 KiB |
| 2. Context | |
| Author | 1 Martinetz, Thomas 2 Madany Mamlouk, Amir 3 Mota, Cicero |
| Affiliation | 1 Institute for Neuro- and Bioinformatics, University of L uebeck 2 Institute for Neuro- and Bioinformatics, University of L uebeck 3 Departamento de Matemática, Universidade Federal do Amazonas |
| Editor | Oliveira Neto, Manuel Menezes de Carceroni, Rodrigo Lima |
| e-Mail Address | cicmota@gmail.com |
| Conference Name | Brazilian Symposium on Computer Graphics and Image Processing, 19 (SIBGRAPI) |
| Conference Location | Manaus, AM, Brazil |
| Date | 8-11 Oct. 2006 |
| Publisher | IEEE Computer Society |
| Publisher City | Los Alamitos |
| Book Title | Proceedings |
| Tertiary Type | Full Paper |
| History (UTC) | 2006-08-16 16:50:13 :: cicmota -> banon :: 2006-08-30 21:54:59 :: banon -> cicmota :: 2008-07-17 14:11:03 :: cicmota -> administrator :: 2009-08-13 20:38:11 :: administrator -> banon :: 2010-08-28 20:02:25 :: banon -> administrator :: 2022-06-14 00:13:19 :: administrator -> :: 2006 |
| 3. Content and structure | |
| Is the master or a copy? | is the master |
| Content Stage | completed |
| Transferable | 1 |
| Version Type | finaldraft |
| Keywords | computational geometry smallest enclosing ball pattern recognition |
| Abstract | The incremental Badoiu-Clarkson algorithm finds the smallest ball enclosing n point in d dimensions with at least O(1/t^0.5) precision, after t iteration steps. The extremely simple incremental step of the algorithm makes it very attractive both for theoreticians and practitioners. A simplified proof for this convergence is given. This proof allows to show that the precision increases, in fact, even as O(u/t) with the number of iteration steps. Computer experiments, but not yet a proof, suggest that the u, which depends only on the data instance, is actually bounded by min{(2d)^0.5,(2n)^0.5}. If it holds, then the algorithm finds the smallest enclosing ball with epsilon precision in at most O(nd (d')^0.5 }/epsilon) time, with d=min{d,n}. |
| Arrangement 1 | urlib.net > SDLA > Fonds > SIBGRAPI 2006 > Fast and Easy... |
| Arrangement 2 | urlib.net > SDLA > Fonds > Full Index > Fast and Easy... |
| doc Directory Content | access |
| source Directory Content | there are no files |
| agreement Directory Content | there are no files |
| 4. Conditions of access and use | |
| data URL | http://urlib.net/ibi/6qtX3pFwXQZG2LgkFdY/MaSC6 |
| zipped data URL | http://urlib.net/zip/6qtX3pFwXQZG2LgkFdY/MaSC6 |
| Language | en |
| Target File | MotaC_SmallestEnclosingBalls.pdf |
| User Group | cicmota administrator |
| Visibility | shown |
| 5. Allied materials | |
| Next Higher Units | 8JMKD3MGPEW34M/46RFT7E 8JMKD3MGPEW34M/4742MCS |
| Citing Item List | sid.inpe.br/sibgrapi/2022/05.08.00.20 4 |
| Host Collection | sid.inpe.br/banon/2001/03.30.15.38 |
| 6. Notes | |
| Empty Fields | archivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage edition electronicmailaddress group isbn issn label lineage mark mirrorrepository nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume |